Stream-Query Compilation with Ontologies

نویسندگان

  • Özgür L. Özçep
  • Ralf Möller
  • Christian Neuenstadt
چکیده

Rational agents perceiving data from a dynamic environment and acting in it have to be equipped with capabilities such as decision making, planning etc. We assume that these capabilities are based on query answering with respect to (high-level) streams of symbolic descriptions, which are grounded in (low-level) data streams. Queries need to be answered w.r.t. an ontology. The central idea is to compile ontologybased stream queries (continuous or historical) to relational data processing technology, for which efficient implementations are available. We motivate our query language STARQL (Streaming and Temporal ontology Access with a Reasoning-Based Query Language) with a sensor data processing scenario, and compare the approach realized in the STARQL framework with related approaches regarding expressivity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantics of Stream Query Languages Using Ontologies‹

In order to satisfy the industrial requirements of processing dynamic knowledge from possibly heterogeneous sources, various query languages have been proposed which aim at lifting the relational stream query languages to the ontological/semantic layer. Most of the languages adapt important relational stream operators such as sliding window operators to this layer. But the adaptation and the se...

متن کامل

Efficient Query Answering Through Approximation

In this poster, we propose to recast the idea of knowledge compilation into approximating OWL DL ontologies with DL-Lite ontologies, against which query answering has only polynomial data complexity. We identify a useful category of queries for which our approach also guarantees completeness. Furthermore, we paper report on the implementation of our approach in the ONTOSEARCH2 system.

متن کامل

Approximating OWL-DL Ontologies

Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential way to reduce the complexity of query answering over OWL DL ontologies. Existing approaches are mainly based on syntactic approximation of ontological axioms and queries. In this paper, we propose to recast the idea of ...

متن کامل

News on Temporal Conjunctive Queries

Temporal query languages are important for stream processing, and ontologies for stream reasoning. Temporal conjunctive queries (TCQs) have therefore been investigated recently together with description logic ontologies, and the knowledge we have about the combined complexities is rather complete. However, often the size of the queries and the ontology is negligible, and what costs is the data....

متن کامل

DBToaster: A SQL Compiler for High-Performance Delta Processing in Main-Memory Databases

We present DBToaster, a novel query compilation framework for producing high performance compiled query executors that incrementally and continuously answer standing aggregate queries using in-memory views. DBToaster targets applications that require efficient main-memory processing of standing queries (views) fed by high-volume data streams, recursively compiling view maintenance (VM) queries ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015